10
10.0

audio

#
eye 10

#
favorite 0

#
comment 0

Topics: Radio Program, Crimes, Streets, Investment, Political science, International relations, Council...

4
4.0

audio

#
eye 4

#
favorite 0

#
comment 0

Topics: Radio Program, Conferences, Sorting algorithms, Social concepts, Unsolved problems in neuroscience,...

10
10.0

audio

#
eye 10

#
favorite 0

#
comment 0

Topics: Radio Program, BBC World Service, Formula 3 Euro Series drivers, Embryology, Member states of the...

7
7.0

audio

#
eye 7

#
favorite 0

#
comment 0

Topics: Radio Program, NUTS 1 statistical regions of the European Union, NUTS 1 statistical regions of the...

7
7.0

audio

#
eye 7

#
favorite 0

#
comment 0

Topics: Radio Program, Milton Keynes, Social psychology, Political philosophy, Reclaimed words, Algorithms,...

11
11

audio

#
eye 11

#
favorite 0

#
comment 0

Topics: Radio Program, Forms of government, Political science, Poverty, Elections, Guitars, South Asia,...

4
4.0

audio

#
eye 4

#
favorite 0

#
comment 0

Topics: Radio Program, Sports terminology, Orders, decorations, and medals, Constitutional law, Bantu...

0
0.0

movies

#
eye 0

#
favorite 0

#
comment 0

The Senate Commerce Committee held a hearing to examine how technology companies use algorithms and machine learning to influence the public. Testifying before the committee were industry scholars and professionals who offered insight into companies, such as Google, Youtube, and Facebook. Sponsor: Senate Commerce, Science and Transportation Subcommittee on Communications, Technology, Innovation, and the Internet

Topics: Senate Commerce Hearing on Tech Companies Use of Algorithms, Television Program

Source: Comcast Cable

3
3.0

Jun 30, 2018
06/18

by
Merav Parter

texts

#
eye 3

#
favorite 0

#
comment 0

An $(\alpha,\beta)$-spanner of an $n$-vertex graph $G=(V,E)$ is a subgraph $H$ of $G$ satisfying that $dist(u, v, H) \leq \alpha \cdot dist(u, v, G)+\beta$ for every pair $(u, v)\in V \times V$, where $dist(u,v,G')$ denotes the distance between $u$ and $v$ in $G' \subseteq G$. It is known that for every integer $k \geq 1$, every graph $G$ has a polynomially constructible $(2k-1,0)$-spanner of size $O(n^{1+1/k})$. This size-stretch bound is essentially optimal by the girth conjecture. It is...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1404.6835

4
4.0

Jun 28, 2018
06/18

by
Therese Biedl; Martin Derka

texts

#
eye 4

#
favorite 0

#
comment 0

Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an $(r,s)$-canonical order, which unifies many of the existing variants of canonical orderings. We then show that $(3,1)$-canonical ordering for 4-connected triangulations always exist; to our knowledge this variant of canonical ordering was not previously known. We use it to give much simpler proofs of two previously known graph drawing results...

Topics: Computational Geometry, Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1511.00873

0
0.0

Apr 20, 2020
04/20

by
Wang, Xiaodong

texts

#
eye 0

#
favorite 0

#
comment 0

329 pages : 26 cm

Topics: Computer programming, Computer algorithms, Dian zi ji suan ji -- suan fa fen xi -- gao deng xue...

The paper gives an algorithm for L-shaped linear programs which arise naturally in optimal control problems with state constraints and stochastic linear programs (which can be represented in this form with an infinite number of linear constraints). The first section describes a cutting hyperplane algorithm which is shown to be equivalent to a partial decomposition algorithm of the dual program. The two last sections are devoted to applications of the cutting hyperplane algorithm to a linear...

Topics: DTIC Archive, Van Slyke, R M, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *CONTROL,...

Fast and accurate techniques for determining electron fluxes and energy deposition profile in complex multidimensional microcircuits have been developed. The multidimensional Spencer-Lewis Transport equation is solved deterministically using several special numerical techniques. We begin with the derivation of the Spencer-Lewis equation. Then we discuss SMART scattering theory that enables us to replace the highly anisotropic electron scattering kernal by one that is more amenable to numerical...

Topics: DTIC Archive, Filippone, W L, ARIZONA UNIV TUCSON DEPT OF NUCLEAR AND ENERGY ENGINEERING,...

Radar Electronic Support Measures (ESM) systems are faced with increasingly dense and complex electromagnetic environments. Traditional algorithms for signal recognition and analysis are highly complex, computationally intensive, often rely on heuristics, and require humans to verify and validate the analysis. In this paper, the use of an alternative technique - artificial neural networks - to classify pulse-to-pulse signal modulation patterns is investigated. Neural networks are an attractive...

Topics: DTIC Archive, Carter, Christopher A, DEFENCE RESEARCH ESTABLISHMENT OTTAWA (ONTARIO), *NEURAL NETS,...

The vertebrate retina consists of a series of sheets of neurons each containing a patterned representation, or neural image corresponding to the incoming visual scene. Most of the operations can be described as convolutions implementing small kernels involving local neighborhoods. These patterns become more complex as the visual signal passes through the retina as each new convolution builds upon previous ones. Because we have access only to single cells, these patterns of activity have never...

Topics: DTIC Archive, Werblin, Frank, CALIFORNIA UNIV BERKELEY SPONSORED PROJECTS OFFICE, *IMAGE...

Topics: DTIC Archive, Friedman, Avner, MINNESOTA UNIV MINNEAPOLIS INST FOR MATHEMATICS AND ITS...

The Knowledge Worker Systems (KWS) is a performance support environment for workgroups. It is an automated tool that enables a workgroup to define the tasks, information resources, institutional knowledge and computer applications required to perform their business processes. Using this on-line model of the business process, KWS reminds workers when tasks are due, details steps for task execution, provides easy automated access to documents, and links to existing automation systems. The U.S....

Topics: DTIC Archive, Brown, Gerald J., CONSTRUCTION ENGINEERING RESEARCH LAB (ARMY) CHAMPAIGN IL,...

Knowing that reasoning over probabilistic networks is, in general, NP-hard, and that most reasoning environments have limited resources, we need to select algorithms that can solve a given problem as fast as possible. This thesis presents a method for predicting the relative performance of reasoning algorithms based on the domain characteristics of the target knowledge structure. Armed with this knowledge, the research shows how to choose the best algorithm to solve the problem. The effects of...

Topics: DTIC Archive, Borghetti, Brett J, AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH, *KNOWLEDGE BASED...

The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these areas differ in terms of their emphasis and the problems typically studied, there are a collection of results in Computational Learning Theory that fit nicely into the 'on-line algorithms' framework. This survey article discusses some of the results, models, and open problems from Computational Learning Theory that seem...

Topics: DTIC Archive, Blum, Avrim L., CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE,...

Before 1990, the Department of Defense (DoD) modeling and simulation effort was fragmented and uncoordinated. Developers of new simulations usually had to start from scratch and could reuse very few of the components from legacy models. Simulations from different developers were incompatible and inconsistent. One of the features of object-oriented programming (OOP) is the prospect of reusing design and code on future projects. However, reuse does not simply happen, it must be planned by...

Topics: DTIC Archive, Dudgeon, Douglas E., NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *ARMY, *OBJECT ORIENTED...

This paper describes an Air Traffic Simulator (ATS) that provides a simulation capability for terminal area automation. The ATS is capable of realistic terminal area modeling, automation performance and feasibility studies, and system wide fault-tolerance analysis. The ATS is evaluated through modeling of self-spacing and self-merging of aircraft following Standard Terminal Arrival (STARs). These algorithms are described in detail and preliminary analysis results are provided. The analysis...

Topics: DTIC Archive, Parikh, Stavan M, INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING...

This report covers the period between June 15, 1999 and September 14, 2001. Detailed technical information on the research described is not presented here, but can be found in attached reports and journal publications and in portions of the recent text edited by R.J. Barker and E. Schamiloglu. Many of the algorithms discussed here have been implemented in the XOOPIC code, which is freely available for noncommercial use thus, providing benefit to the entire PIC community.

Topics: DTIC Archive, Bruhwiler, David, TECH-X CORP BOULDER CO, *COMPUTERIZED SIMULATION, *ELECTRON...

Parametric and non-parametric change detection algorithms are applied to the problem of detecting changes in the direction of traffic flow. The directionality of the change in a network flow is assumed to have an objective or target. The particular problem of detecting distributed denial of service attacks from distributed observations is presented as a working framework. The performance of our change detection algorithms is evaluated via simulations.

Topics: DTIC Archive, Baras, J S, MARYLAND UNIV COLLEGE PARK DEPT OF ELECTRICAL AND COMPUTER ENGINEERING,...

This work addresses problems of sensor resource management (SRM) in which one or more sensors obtain measurements of the state of one or more targets. For example, an airborne radar may be attempting to track several ground targets, which are sometimes stationary (requiring a synthetic aperture radar mode) and sometimes moving (requiring a ground moving target indication radar mode). The challenge is to schedule the radar modes as the scenario evolves. Such problems can generally be formulated...

Topics: DTIC Archive, Schneider, Michael K, BAE SYSTEMS BURLINGTON MA, *ALGORITHMS, *TRACKING, SCENARIOS,...

We describe the implementation of a fluid dynamical benchmark on the 256 node SUPRENUM-1 parallel computer. The benchmark, the Shallow Water Equations, is frequently used as a model for both oceanographic and atmospheric circulation. We describe the steps involved in implementing the algorithm on the SUPRENUM-1 and we provide details of performance. We have measured 4.95 Mflops (64-bit arithmetic) for single node performance, and 1200 Miflops aggregate performance with 256 nodes, at...

Topics: DTIC Archive, McBryan, Oliver A, COLORADO UNIV AT BOULDER DEPT OF COMPUTER SCIENCE, *EQUATIONS,...

The Apache was the first helicopter of its kind to fly with the tail rotor blade offset by 55 degrees as opposed to the traditional 90 degrees. Current balancing methods approximate the rotor system as a traditional 4 bladed, same plane system with different weight sensitivity coefficients for each set of blades. The Apache tail rotor computer model was built using the Rotorcraft Comprehensive Analysis System (RCAS) program. The objective was not to develop solutions for the sensitivity...

Topics: DTIC Archive, Newkirk, Mark C, AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH DEPT OF AERONAUTICS...

Features are a means of statistical pattern recognition that ATR algorithms use to discriminate ground targets from the surrounding clutter background and, subsequently, to sort potential targets into one of several target classes (including the non-target case). Problems for ATR arise from the specular nature of radar imagery because small changes to the configuration of targets can result in significant changes to the resulting target signature [3][4]. This adds to the challenge of...

Topics: DTIC Archive, Schimpf, Hartmut, FGAN-FKIE WACHTBERG (GERMANY), *ALGORITHMS, *SURFACE TARGETS,...

The international clock ensemble, which contributes to the generation of International Atomic Time (TAI and UTC), has improved dramatically over the last few years. The main change has been the introduction of a significant number of HP 5071A clocks. Of the 313 clocks contributing to TAI/UTC during 1994, 94 of these were HP 5071As. The environmental insensitivity of the HP 5071A clocks is more than an order of magnitude better than that of previous contributing clocks. This environmental...

Topics: DTIC Archive, ALLAN'S TIME FOUNTAIN GREEN UT, *STABILITY, *REAL TIME, *ATOMIC CLOCKS, ACCURACY,...

The long-term objective is to provide a comprehensive worldwide optics database that includes data on a broad range of important optical properties, including diffuse attenuation, beam attenuation, and scattering. Data from ONR-funded bio-optical cruises are given priority for loading into the database, but data from other scientific programs (NASA, NODC, NSF) and from other countries will also be routinely added to the Worldwide Ocean Optics Database (WOOD)1. The database shall be easy to use,...

Topics: DTIC Archive, JOHNS HOPKINS UNIV LAUREL MD APPLIED PHYSICS LAB, *DATA BASES, OCEAN ENVIRONMENTS,...

In this paper, low-complexity joint power assignment algorithms are developed for multi-source multi-destination relay networks where multiple sources share a common relay that forwards all received signals simultaneously to destinations. In particular, we consider the following power optimization strategies: (i) Minimization of the total transmission power of the sources and the relay under the constraint that the signal-to-interference-plus-noise ratio (SINR) requirement of each...

Topics: DTIC Archive, STATE UNIV OF NEW YORK AT BUFFALO DEPT OF ELECTRICAL ENGINEERING, *COMMUNICATIONS...

A need for a quick response to cyber attacks is a prevalent problem for computer network operators today. There is a small window to respond to a cyber attack when it occurs to prevent significant damage to a computer network. Automated response planners offer one solution to resolve this issue. This work presents Network Defense Planner System (NDPS), a planner dependent on the effectiveness of the detection of the cyber attack. This research first explores making classification of network...

Topics: DTIC Archive, AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING AND MANAGEMENT,...

Clustering is a data mining technique for analysing large data sets and finding groups of elements within the data set that are similar to each other. The use of clustering on archives of historical air surveillance track data would enable the discovery of flights that exhibited similar behaviour and followed similar flight paths. However there are many different clustering algorithms available, so some method for selecting the best from the competing algorithms is required. Unfortunately the...

Topics: DTIC Archive, DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION EDINBURGH (AUSTRALIA) COMMAND CONTROL...

Case study inverse thermal analyses of Ti-6Al-4V deep penetration welds are presented. These analyses employ a methodology that is in terms of analytical basis functions for inverse thermal analysis of steady state energy deposition in plate structures. The results of the case studies provide parametric representations of weld temperature histories that can be adopted as input data to various types of computational procedures, such as those for prediction of solid-state phase transformations....

Topics: DTIC Archive, NAVAL RESEARCH LAB WASHINGTON DC, *THERMAL ANALYSIS, *WELDS, ALGORITHMS, CASE...

In this paper, a robust pose (i.e., position and orientation) estimation algorithm using two-views captured by calibrated monocular camera is presented. A collection of pose hypotheses is obtained when more than the minimum number of feature points required to uniquely identify a pose are available in both images.

Topics: DTIC Archive, FLORIDA UNIV GAINESVILLE DEPT OF MECHANICAL AND AEROSPACE ENGINEERING, *COMPUTER...

This study has focused on five complementary research tasks in the domain of audio, speech, language, and speaker recognition and processing. In the area of speaker recognition/identification (SID), advancements have been realized to address acoustic mismatch due to speaker overlap, language mismatch, channel/microphone/additive noise, speaker style (spoken vs. singing), speaker state (physical task stress), distant speech, and environment based (room reverberation). In language ID (LID),...

Topics: DTIC Archive, TEXAS UNIV AT DALLAS RICHARDSON, *SPEECH RECOGNITION, ALGORITHMS, EXTRACTION,...

Hierarchical Task Network (HTN) planning is the problem of decomposing an initial task into a sequence of executable steps. Often viewed as just a way to encode human knowledge to solve classical planning problems faster, HTN planning is more expressive than classical planning, even to the point of being undecidable in the general case. However, HTN planning is not just a way to solve planning problems faster, but is itself a search problem that can benefit from its own distinct search...

Topics: DTIC Archive, MARYLAND UNIV COLLEGE PARK, *HEURISTIC METHODS, *HIERARCHIES, *KNOWLEDGE BASED...

Because of the advantage associated with GPS/MET observations, there are many potential applications and uses of global GPS/MET observations, particularly in climate research and weather prediction. Our goal is to develop inversion algorithms for extracting bending angles and TEC inversions of the GPS signal and the distribution of ionospheric and atmospheric variables from GPS/MET occultations and to contribute our results with the scientific community for their optimum utility, especially to...

Topics: DTIC Archive, NATIONAL CENTRAL UNIV CHUNG-LI (TAIWAN), *WEATHER FORECASTING, ALGORITHMS, CLIMATE,...

Remote sensing algorithms for the marine environment have traditionally relied upon semi-empirical approaches to determining water column properties. These algorithms are usually depth-integrals of a proxy of desired information, i.e., chlorophyll algorithms are a proxy for water column autotrophic biomass. The goal of this work is to use the increased spectral resolution of current satellite and aircraft data systems to solve for the depth-dependent optical properties of interest, e.g.,...

Topics: DTIC Archive, FLORIDA ENVIRONMENTAL RESEARCH INST TAMPA FL, *OCEAN ENVIRONMENTS, ALGORITHMS,...

Although computerized adaptive tests acquire their efficiency by successively selecting items that provide optimal measurement at each examinee's estimated level of ability, operational testing programs will typically consider additional factors in item selection. In practice, items are generally selected with regard to at least three, often conflicting, goals: (1) to maximize test efficiency by measuring examinees as quickly and accurately as possible; (2) to protect the security of the item...

Topics: ERIC Archive, Ability, Adaptive Testing, Algorithms, Computer Assisted Testing, Efficiency,...

This paper discusses an alternate formalism for context-free phrase structure grammar. The author feels that if a grammar is stated completely explicitly it can be represented in the form of a relational network of the type proposed by Lamb. He discusses some formal properties of such networks and makes some revisions to Lamb's formulation which allow the formal properties and the structural complexity count to be kept as simple as possible. The notion of "hill climbing" on...

Topics: ERIC Archive, Algorithms, Context Free Grammar, Linguistic Theory, Networks, Phrase Structure,...

In this paper, we propose a single low dimensional representation of a large collection of table and hyponym data, and show that with a small number of primitive operations, this representation can be used effectively for many purposes. Specifically we consider queries like set expansion, class prediction etc. We evaluate our methods on publicly available semi-structured datasets from the Web.

Topics: DTIC Archive, Dalvi,Bhavana, Carnegie Mellon University Pittsburgh United States, DATA STRUCTURES,...

An algorithm for the 0-1 knapsack problem (KP) is described which relies mainly on three new ideas. The first one is to focus on the core of the problem, namely a knapsack problem equivalent to (KP), defined on a particular subset of the variables. The size of this core is usually a small fraction of the full problem size, and does not seem to increase with the latter. While the core cannot be identified without solving (KP), a satisfactory approximation can be found by solving (LKP), the...

Topics: DTIC Archive, Balas,Egon, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP,...

The effects of unsteady modes of motion on two-dimensional transonic flows are investigated. Numerical algorithms that treat shock waves as moving discontinuities are described for nonlinear and time-linearized perturbation flows. Results for transonic flow past an NACA 64A006 airfoil experiencing harmonic motions in one of several modes are presented. (Author)

Topics: DTIC Archive, Seebass,A R, ARIZONA UNIV TUCSON DEPT OF AEROSPACE AND MECHANICAL ENGINEERING,...

This paper considers an organization that repairs or overhauls a single type of complex equipment such as aircraft transmitters, navigational computers, or electrical generating units. The organization inventories the repaired assets to meet probabilistic demands for serviceable items. Additional serviceable stocks may also be purchased from outside vendors if the repair process does not satisfy all demands. The paper considers the problem of computing jointly optimal procurement and repair...

Topics: DTIC Archive, Demmy,W Steven, WRIGHT STATE UNIV DAYTON OH DEPT OF ADMINISTRATIVE SCIENCE AND...

Efficient reanalysis models, which provide high quality explicit approximations for the structural behavior, are introduced. The presented algorithms are based on a series expansion which is shown to be equivalent to a simple iteration procedure. Only the decomposed stiffness matrix, known from exact analysis of the initial design, is required to obtain the approximate expressions. Two approaches of accelerated convergence are proposed to improve the quality of the approximations: (a) An...

Topics: DTIC Archive, Kirsch, U., Hofman, B., TECHNION - ISRAEL INST OF TECH HAIFA DEPT OF CIVIL...

3
3.0

May 26, 2020
05/20

by
International Symposium on Neural Networks (2nd : 2005 : Chongqing, China)

texts

#
eye 3

#
favorite 0

#
comment 0

1 online resource (3 volumes) :

Topics: Neural computers -- Congresses, Neural networks (Computer science) -- Congresses, Ordinateurs...

5
5.0

Jun 29, 2018
06/18

by
Zeyuan Allen-Zhu; Yuanzhi Li

texts

#
eye 5

#
favorite 0

#
comment 0

We study streaming principal component analysis (PCA), that is to find, in $O(dk)$ space, the top $k$ eigenvectors of a $d\times d$ hidden matrix $\bf \Sigma$ with online vectors drawn from covariance matrix $\bf \Sigma$. We provide $\textit{global}$ convergence for Oja's algorithm which is popularly used in practice but lacks theoretical understanding for $k>1$. We also provide a modified variant $\mathsf{Oja}^{++}$ that runs $\textit{even faster}$ than Oja's. Our results match the...

Topics: Data Structures and Algorithms, Machine Learning, Numerical Analysis, Mathematics, Optimization and...

Source: http://arxiv.org/abs/1607.07837

We consider the problem of generating motion plans for a robot that are guaranteed to succeed despite uncertainty in the environment, parametric model uncertainty, and disturbances. Furthermore, we consider scenarios where these plans must be generated in real-time, because constraints such as obstacles in the environment may not be known until they are perceived (with a noisy sensor) at runtime. Our approach is to pre-compute a library of funnels along different maneuvers of the system that...

Topics: DTIC Archive, Majumdar,Anirudha, Massachusetts Institute of Technology Cambridge United States,...

The optimal defense and operation of networks against worst-case attack is an important problem for military analysts. We review development of existing solutions for the Defender-Attacker-Defender (DAD) tri-level optimization model and investigate new applications and solution procedures. We develop an implicit enumeration algorithm that incorporates addition of new defenses as an alternative solution method for the DAD model. Our testing demonstrates that implicit enumeration can efficiently...

Topics: DTIC Archive, Lazzaro,Gary L, Naval Postgraduate School Monterey United States, flow network,...

This paper derives an algorithm for use by an airborne mid-air collision avoidance system to determine when an alarm should be given in case a mid-air collision is imminent. The algorithm is based on an extension of the standard modified tau alarm criterion used in most collision avoidance system threat logics. The standard criterion uses only altitude and range data and, as a result, will generate high alarm rates in heavy air traffic. The criterion presented here makes use of bearing data as...

Topics: DTIC Archive, Kay,Irvin W, INSTITUTE FOR DEFENSE ANALYSES ARLINGTON VA SCIENCE AND TECHNOLOGY DIV,...